Object Recognition by Matching Symbolic Edge Graphs
نویسندگان
چکیده
We present an object recognition system based on symbolic graphs with object corners as vertices and outlines as edges. Corners are determined in a robust way by a multiscale combination of an operator modeling cortical end-stopped cells. Graphs are constructed by line-following between corners. Model matching is then done by nding subgraph isomorphisms in the image graph. The complexity is reduced by adding labels to corners and edges. The choice of labels makes the recognition system invariant under translation, rotation, and scaling.
منابع مشابه
Object Recognition by MatchingSymbolic Edge
We present an object recognition system based on symbolic graphs with object corners as vertices and outlines as edges. Corners are determined in a robust way by a multiscale combination of an operator modeling cortical end-stopped cells. Graphs are constructed by line-following between corners. Model matching is then done by nding subgraph isomorphisms in the image graph. The complexity is red...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملExtraction And Matching Of Symbolic Contour Graphs
We describe an object recognition system based on symbolic contour graphs. The image to be analyzed is transformed into a grapha with object corners as vertices and connecting contours as edges. Image corners are determined using a robust multiscale corner detector. Edges are constructed by line-following between corners based on evidence from the multiscale Gabor wavelet transform. Model match...
متن کاملObject Localization and Recognition for a Grasping Robot
|This paper presents a vision system (object localization and recognition) for a grasping robot environment. Our approach to object localization is based on the sequential integration of early vision processes, such as color and edge detection. No assumptions about the object or background are necessary for this process. It detects blobs of interest in the scene and treats them as object candid...
متن کاملOn the revised edge-Szeged index of graphs
The revised edge-Szeged index of a connected graph $G$ is defined as Sze*(G)=∑e=uv∊E(G)( (mu(e|G)+(m0(e|G)/2)(mv(e|G)+(m0(e|G)/2) ), where mu(e|G), mv(e|G) and m0(e|G) are, respectively, the number of edges of G lying closer to vertex u than to vertex v, the number of ed...
متن کامل